Search

Back to Home

01. Motion Planning
02. Introduction to Path Planning
03. About this Lesson
04. Motion Planning
05. Compute Cost
06. Compute Cost 2
07. Optimal Path
08. Optimal Path 2
09. Maze
10. Maze 2
11. First Search Program
12. Expansion Grid
13. Print Path
14. A*
15. Implement A*
16. A* in Action
17. Dynamic Programming
18. Computing Value
19. Computing Value 2
20. Value Program
21. Optimum Policy
22. Left Turn Policy
23. Planning Conclusion

Back to Home

08. Optimal Path 2

Optimal Path 2

Question:

% buffered00:00

00:00

Start Quiz:

Solution:

% buffered00:00

00:00

INSTRUCTOR NOTE:

Enter the cost of the optimal (lowest cost) path.

udacity2.0 If you need the newest courses Plase add me wechat: udacity6